Branch and bound method for regression-based controlled variable selection
نویسندگان
چکیده
منابع مشابه
Branch and bound method for regression-based controlled variable selection
Self-optimizing control is a promising method for selection of controlled variables (CVs) from available measurements. Recently, Ye et al. [2012] have proposed a globally optimal method for selection of self-optimizing CVs by converting the CV selection problem into a regression problem. In this approach, the necessary conditions of optimality (NCO) are approximated with linear combinations of ...
متن کاملA branch-and-bound algorithm for instrumental variable quantile regression
This paper studies a statistical problem called instrumental variable quantile regression (IVQR). We model IVQR as a convex quadratic program with complementarity constraints and—although this type of program is generally NP-hard—we develop a branch-and-bound algorithm to solve it globally. We also derive bounds on key variables in the problem, which are valid asymptotically for increasing samp...
متن کاملBidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-scale problems is difficult, as all feasible measurement subsets need to be evaluated to find the optimal solution. In this paper, a new and efficient branch and bound (BAB) method for selection of CVs using the MSV ru...
متن کاملBidirectional branch and bound for controlled variable selection. Part II: Exact local method for self-optimizing control
The selection of controlled variables (CVs) from available measurements through enumeration of all possible alternatives is computationally forbidding for large-dimensional problems. In Part I of this work [5], we proposed a bidirectional branch and bound (BAB) approach for subset selection problems and demonstrated its efficiency using the minimum singular value criterion. In this paper, the B...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Chemical Engineering
سال: 2013
ISSN: 0098-1354
DOI: 10.1016/j.compchemeng.2013.03.006